228 research outputs found
A simple linear-time algorithm for finding path-decompositions of small width
We described a simple algorithm running in linear time for each fixed
constant , that either establishes that the pathwidth of a graph is
greater than , or finds a path-decomposition of of width at most
. This provides a simple proof of the result by Bodlaender that many
families of graphs of bounded pathwidth can be recognized in linear time.Comment: 9 page
Obstructions to within a few vertices or edges of acyclic
Finite obstruction sets for lower ideals in the minor order are guaranteed to
exist by the Graph Minor Theorem. It has been known for several years that, in
principle, obstruction sets can be mechanically computed for most natural lower
ideals. In this paper, we describe a general-purpose method for finding
obstructions by using a bounded treewidth (or pathwidth) search. We illustrate
this approach by characterizing certain families of cycle-cover graphs based on
the two well-known problems: -{\sc Feedback Vertex Set} and -{\sc
Feedback Edge Set}. Our search is based on a number of algorithmic strategies
by which large constants can be mitigated, including a randomized strategy for
obtaining proofs of minimality.Comment: 16 page
FPT is Characterized by Useful Obstruction Sets
Many graph problems were first shown to be fixed-parameter tractable using
the results of Robertson and Seymour on graph minors. We show that the
combination of finite, computable, obstruction sets and efficient order tests
is not just one way of obtaining strongly uniform FPT algorithms, but that all
of FPT may be captured in this way. Our new characterization of FPT has a
strong connection to the theory of kernelization, as we prove that problems
with polynomial kernels can be characterized by obstruction sets whose elements
have polynomial size. Consequently we investigate the interplay between the
sizes of problem kernels and the sizes of the elements of such obstruction
sets, obtaining several examples of how results in one area yield new insights
in the other. We show how exponential-size minor-minimal obstructions for
pathwidth k form the crucial ingredient in a novel OR-cross-composition for
k-Pathwidth, complementing the trivial AND-composition that is known for this
problem. In the other direction, we show that OR-cross-compositions into a
parameterized problem can be used to rule out the existence of efficiently
generated quasi-orders on its instances that characterize the NO-instances by
polynomial-size obstructions.Comment: Extended abstract with appendix, as accepted to WG 201
Computer science and mathematics in the elementary schools
Computer science is fundamentally about algorithms recipes for solving problems and performing tasks In the same way that children can learn about dinosaurs with out digging for bones and about planets and space without peering into telescopes the intellectual core of computer science is not dependent on machines for its presentation Just as with these other subjects an approach based on stories activities and ordinary materials can be more more vivid and engaging than approaches that make a fetish of computers We argue that algorithmic topics are a good source of material with which to provide for children in the elementary grades a broad exciting and active introduc tion to mathematics Our experiences sharing some of these topics with classrooms in grades one through four ages are described We propose that principles of lan guage acquisition should be applied to the teaching of the mathematical sciences and review how these principles have previously been applied to the teaching of reading and writing We discuss some of the important aspects of the mathematics research com munity experience and explore ways in which this experience can be fostered in th
A Generalization of Nemhauser and Trotter\u27s Local Optimization Theorem
The Nemhauser-Trotter local optimization theorem applies to the NP-hard textsc{Vertex Cover} problem and has applications in approximation as well as parameterized algorithmics. We present a framework that generalizes Nemhauser and Trotter\u27s result to vertex deletion and graph packing problems, introducing novel algorithmic strategies based on purely combinatorial arguments (not referring to linear programming as the Nemhauser-Trotter result originally did).
We exhibit our framework using a generalization of textsc{Vertex Cover}, called textrm{sc Bounded-Degree Deletion}, that has promise to become an important tool in the analysis of gene and other biological networks. For some fixed~, textrm{sc Bounded-Degree Deletion} asks to delete as few vertices as possible from a graph in order to transform it into a graph with maximum vertex degree at most~. textsc{Vertex Cover} is the special case of . Our generalization of the Nemhauser-Trotter theorem implies that textrm{sc Bounded-Degree Deletion} has a problem kernel with a linear number of vertices for every constant~. We also outline an application of our extremal combinatorial approach to the problem of packing stars with a bounded number of leaves. Finally, charting the border between (parameterized) tractability and intractability for textrm{sc Bounded-Degree Deletion}, we provide a W[2]-hardness result for textrm{sc Bounded-Degree Deletion} in case of unbounded -values
Upper and lower bounds for finding connected motifs in vertex-colored graphs
International audienceWe study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices whose multiset of colors equals the motif. This problem is a natural graph-theoretic pattern matching variant where we are not interested in the actual structure of the occurrence of the pattern, we only require it to preserve the very basic topological requirement of connectedness. We give two positive results and three negative results that together give an extensive picture of tractable and intractable instances of the problem
A Generalization of Nemhauser and Trotter's Local Optimization Theorem
The Nemhauser-Trotter local optimization theorem applies to the NP-hard
Vertex Cover problem and has applications in approximation as well as
parameterized algorithmics. We present a framework that generalizes Nemhauser
and Trotter's result to vertex deletion and graph packing problems, introducing
novel algorithmic strategies based on purely combinatorial arguments (not
referring to linear programming as the Nemhauser-Trotter result originally
did). We exhibit our framework using a generalization of Vertex Cover, called
Bounded- Degree Deletion, that has promise to become an important tool in the
analysis of gene and other biological networks. For some fixed d \geq 0,
Bounded-Degree Deletion asks to delete as few vertices as possible from a graph
in order to transform it into a graph with maximum vertex degree at most d.
Vertex Cover is the special case of d = 0. Our generalization of the
Nemhauser-Trotter theorem implies that Bounded-Degree Deletion has a problem
kernel with a linear number of vertices for every constant d. We also outline
an application of our extremal combinatorial approach to the problem of packing
stars with a bounded number of leaves. Finally, charting the border between
(parameterized) tractability and intractability for Bounded-Degree Deletion, we
provide a W[2]-hardness result for Bounded-Degree Deletion in case of unbounded
d-values
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
AbstractIn this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Triangulating Colored Graphs (perfect phylogeny), (Directed) (Modified) Colored Cutwidth, Feasible Register Assignment and Module Allocation for graphs of bounded pathwidth. Each of these problems has as a characteristic a uniform upper bound on the tree or path width of the graphs in âyesâ-instances. For all of these problems with the exceptions of Feasible Register Assignment and Module Allocation, a vertex or edge coloring is given as part of the input. Our main results are that the parameterized variant of each of the considered problems is hard for the complexity classes W[t] for all tâN. We also show that Intervalizing Colored Graphs, Triangulating Colored Graphs, and Colored Cutwidth are NP-Complete
- âŠ